// #include <iostream>
// #include <deque>
// #include <string>
// #include <list>
// using namespace std;
 
// int main()
// {
//     list<int> l1;
//     l1.push_back(1);
//     l1.push_back(2);
//     l1.push_back(3);
//     l1.push_back(4);
//     l1.push_back(5);

//     list<int>::reverse_iterator it = l1.rbegin();
//     while(it != l1.rend())
//     {
//         cout <<*it << endl;
//         it++; 
//     }
//     return 0;
// }

#include <iostream>
using namespace std;
#include "list.hpp"
#include "vector.hpp"

int main()
{
    bit::list<int> li1;
    li1.push_back(1);
    li1.push_back(2);
    li1.push_back(3);
    li1.push_back(4);
    li1.push_back(5);
    bit::list<int>::reverse_iterator it = li1.rbegin();
    while(it != li1.rend())
    {
        cout << *it << " ";
        ++it;
    }
    cout << endl;

    bit::vector<int> v1;
    v1.push_back(1);
    v1.push_back(2);
    v1.push_back(3);
    v1.push_back(4);
    v1.push_back(5);
    v1.push_back(6);
    bit::vector<int>::reverse_iterator it1 = v1.rbegin();

    while(it1 != v1.rend())
    {
        cout << *it1 << " ";
        ++it1;
    }
    cout << endl;
    return 0;
}
